Combining supervisor synthesis and model checking
نویسندگان
چکیده
منابع مشابه
Combining Model Checking and Discrete-Event Supervisor Synthesis
We present an approach to facilitate the design of provably correct concurrent systems by recasting recent work that uses discrete-event supervisor synthesis to automatically generate concurrency control code in Promela and combine it with model checking in Spin. This approach consists of the possibly repeated execution of three steps: manual preparation, automatic synthesis, and semi-automatic...
متن کاملA unified model checking framework for the supervisor synthesis problem
Abstract. The supervisor synthesis problem asks whether one can restrict the behavior of a reactive system such that it satisfies a given specification. As it is more general, this problem is harder than the verification problem. Several approaches based on different logics have been developed to tackle the supervisor synthesis problem. In this paper, we show that the most prominent logics, nam...
متن کاملMaster subject Model Checking Petri Nets Supervisor
The theory of Well Structured Transition Systems, (WSTS) allows the automatical verification of safety properties of infinite-state systems, such that parts of reachability sets can be finitely represented [7, 11, 10]. Termination, boundedness and coverability are decidable for WSTS [4, 5, 9]. As Petri nets are WSTS, the previous properties are decidable. For complete WSTS [10], the Karp and Mi...
متن کاملCombining Model Checking and Testing
Model checking and testing have a lot in common. Over the last two decades, significant progress has been made on how to broaden the scope of model checking from finite-state abstractions to actual software implementations. One way to do this consists of adapting model checking into a form of systematic testing that is applicable to industrial-size software. This chapter presents an overview of...
متن کاملSCTL: Towards Combining Model Checking and Proof Checking
Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and the complete automaticity of model checking. The focus of this paper is on the verification of the temporal logic properties of Kripke models. The properties a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Embedded Computing Systems
سال: 2005
ISSN: 1539-9087
DOI: 10.1145/1067915.1067920